Synthesis of force-closure grasps on 3-D objects based on the Q distance

نویسندگان

  • Xiangyang Zhu
  • Jun Wang
چکیده

The synthesis of force-closure grasps on three–dimensional (3-D) objects is a fundamental issue in robotic grasping and dextrous manipulation. In this paper, a numerical force-closure test is developed based on the concept of distance. With some mild and realistic assumptions, the proposed test criterion is differentiable almost everywhere and its derivative can be calculated exactly. On this basis, we present an algorithm for planning force-closure grasps, which is implemented by applying descent search to the proposed numerical test in the grasp configuration space. The algorithm is generally applicable to planning optimal force-closure grasps on 3-D objects with curved surfaces and with arbitrary number of contact points. The effectiveness and efficiency of the algorithm are demonstrated by using simulation examples.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On computing three-finger force-closure grasps of 2-D and 3-D objects

In this paper, we present a novel algorithm for computing three-finger force-closure grasps of two-dimensional (2-D) and three-dimensional (3-D) objects. In the case of a robot hand with three hard fingers and point contact with friction, new necessary and sufficient conditions for 2-D and 3-D equilibrium and force-closure grasps have been deduced, and a corresponding algorithm for computing fo...

متن کامل

Synthesis and Optimization of Force Closure Grasps via Sequential Semidefinite Programming

In this paper we present a novel approach for synthesizing and optimizing both positions and forces in force closure grasps. This problem is a non-convex optimization problem in general since it involves constraints that are bilinear; in particular, computing wrenches involves a bilinear product between grasp contact points and contact forces. Thus, conventional approaches to this problem typic...

متن کامل

Easily Computable Optimum Grasps in 2-D and 3-D

We consider the problem of nding optimum force closure grasps of two and three-dimensional objects. Our focus is on grasps which are useful in practice, namely grasps with a small number of ngers, with friction at the contacts. Assuming frictional contact and rounded nger tips|very mild assumptions in practice|we give new upper (and lower) bounds on the number of ngers necessary to achieve forc...

متن کامل

Fast Construction of Force-Closure Grasps - Robotics and Automation, IEEE Transactions on

AbstructThis article presents a new theorem and an algorithm for fast synthesis of two-fingered force-closure grasps for arbitrary polygonal objects. The polygonal objects are allowed to be of arbitrary shape, in the sense that there is no restriction that the objects he convex. Moreover, each edge of the polygon is allowed to have different frictional characteristics. Our novel formulation res...

متن کامل

Grasp analysis and synthesis based on a new quantitative measure

In this paper, we present a quantitative measure of multifingered grasps. The measure quantifies the capability of a grasp in firmly holding an object while resisting external loads and/or disturbances. It can also be used for qualitative test of closure properties (form closure and force closure). For planar grasps and frictionless three-dimensional (3-D) grasps, the quantitative measure can b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Robotics and Automation

دوره 19  شماره 

صفحات  -

تاریخ انتشار 2003